An FPGA Implementation of an Elliptic Curve Processor over
نویسندگان
چکیده
This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock frequency becomes independent of the bit length m.
منابع مشابه
FPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor
Elliptic curve cryptography (ECC) has been the focus of much recent attention since it ooers the highest security per bit of any known public key cryptosystem. This beneet of smaller key sizes makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper a microcoded Xilinx Virtex based elliptic curve processor is d...
متن کاملElliptic Curve Crypto-processor
In this paper, we propose an elliptic curve key generation processor over GF(2 163 ) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using...
متن کاملA microcoded elliptic curve processor using FPGA technology
The implementation of a microcoded elliptic curve processor using field-programmable gate array technology is described. This processor implements optimal normal basis field operations in 2 . The design is synthesized by a parameterized module generator, which can accommodate arbitrary and also produce field multipliers with different speed/area tradeoffs. The control part of the processor is m...
متن کاملHardware Implementation of Elliptic Curve Point Multiplication over GF (2) for ECC protocols
The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF (2). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic ...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کامل